Asymptotic analysis for extreme eigenvalues of principal minors of random matrices

نویسندگان

چکیده

Consider a standard white Wishart matrix with parameters n and p. Motivated by applications in high-dimensional statistics signal processing, we perform asymptotic analysis on the maxima minima of eigenvalues all m×m principal minors, under regime that n, p, m go to infinity. Asymptotic results concerning extreme minors real Wigner matrices are also obtained. In addition, discuss an application theoretical construction compressed sensing matrices, which provides insights processing linear regression statistics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extreme Gaps between Eigenvalues of Random Matrices

This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian Unitary Ensemble. In particular, the kth smallest gap, normalized by a factor n, has a limiting density proportional to x3k−1e−x 3 . Concerning the largest gaps, normalized by n/ √ logn, they converge...

متن کامل

Extreme value statistics of eigenvalues of Gaussian random matrices.

We compute exact asymptotic results for the probability of the occurrence of large deviations of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary, and symplectic ensembles. In particular, we show that the probability that all the eigenvalues of an (NxN) random matrix are positive (negative) decreases for large N as approximately exp [-beta theta...

متن کامل

Asymptotic Distribution of Eigenvalues and Degeneration of Sparse Random Matrices

This work is concerned with an asymptotical distribution of eigenvalues of sparse random matrices. It is shown that the semicircle law which is known for random matrices is also valid for the sparse random matrices with sparsity nIN=o(1), where n is the matrix size and 2N the number of non-zero elements of the matrix. The degree of degeneration is also estimated for the matrices with 2N—cn (c>0...

متن کامل

Non-asymptotic theory of random matrices: extreme singular values

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to information theory operate with random matrices in fixed dimensions. This survey addresses the non-asymptotic theory of extreme singular values of random matrices w...

متن کامل

Aspects of pseudorank estimation methods based on the eigenvalues of principal component analysis of random matrices

Nowadays, analytical instruments that produce a data matrix for one chemical sample enjoy a widespread popularity. However, for a successful analysis of these data an accurate estimate of the pseudorank of the matrix is often a crucial prerequisite. A large number of methods for estimating the pseudorank are based on the eigenvalues obtained from principal component analysis (PCA) . In this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Applied Probability

سال: 2021

ISSN: ['1050-5164', '2168-8737']

DOI: https://doi.org/10.1214/21-aap1668